The number of different words that can be formed from the letters of the word $SUCCESS$ in which the two $C$ are together but no two $S$ are together are:

How many numbers less than $1000$ can be made from the digits $1, 2, 3, 4, 5, 6$ (repetition is not allowed)?

How many $3$-letter words can be formed from the letters of the word '$EXPERTISE$',if repetition of letters is not allowed?

$A = \{ x_1, x_2, x_3, x_4 \}; \, B = \{ y_1, y_2, y_3, y_4 \}.$ $A$ function is defined from set $A$ to set $B.$ The number of one-one functions such that $f(x_i) \neq y_i$ for $i = 1, 2, 3, 4$ is equal to:

If $n$ objects are arranged in a row,then the number of ways of selecting three of these objects so that no two of them are next to each other is:

How many numbers lying between $1000$ and $10000$ can be formed by using the digits $1, 3, 5, 6, 7, 8, 9$ if no digits are repeated?